How to construct optimal one-time signatures
نویسندگان
چکیده
منابع مشابه
How to construct optimal one-time signatures
One-time signature (OTS) offer a viable alternative to public key-based digital signatures. OTS security is typically based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of some mathematical problem. Although many OTS methods have been proposed in the past, no solid foundation exists for judging their efficiency or optimality. This pap...
متن کاملOn Constructing Optimal One-Time Signatures
One-time signatures (OTS) offer a viable alternative to public keybased digital signatures. OTS security is based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of a mathematical problem. OTS methods have been proposed in the past but no solid foundation exists for judging their efficiency or optimality. This paper develops a new method...
متن کاملTagged One-Time Signatures: Tight Security and Optimal Tag Size
We present an efficient structure-preserving tagged one-time signature scheme with tight security reductions to the decision-linear assumption. Our scheme features short tags consisting of a single group element and gives rise to the currently most efficient structure-preserving signature scheme based on the decision-liner assumption with constant-size signatures of only 14 group elements, wher...
متن کاملOptimal Tree-based One-time Digital Signatures Schemes
A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be deened: U V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of eecient cryptographic digital signature schem...
متن کاملShort one-time signatures
We present a new one-time signature scheme having short signatures. Our new scheme is also the first one-time signature scheme that supports aggregation, batch verification, and which admits efficient proofs of knowledge. It has a fast signing algorithm, requiring only modular additions, and its verification cost is comparable to ECDSA verification. These properties make our scheme suitable for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2003
ISSN: 1389-1286
DOI: 10.1016/s1389-1286(03)00285-8